Green’s Function for a Hierarchical Self-Avoiding Walk in Four Dimensions
نویسندگان
چکیده
This is the second of two papers on the end-to-end distance of a weakly selfrepelling walk on a four dimensional hierarchical lattice. It completes the proof that the expected value grows as a constant times √ T log 1 8 T (
منابع مشابه
End-to-end Distance from the Green’s Function for a Hierarchical Self-Avoiding Walk in Four Dimensions
In [BEI] we introduced a Levy process on a hierarchical lattice which is four dimensional, in the sense that the Green’s function for the process equals 1 |x|2 . If the process is modified so as to be weakly self-repelling, it was shown that at the critical killing rate (mass-squared) βc, the Green’s function behaves like the free one. Now we analyze the end-to-end distance of the model and sho...
متن کاملCritical Behaviour of Self-avoiding Walk in Five or More Dimensions
We use the lace expansion to prove that in five or more dimensions the standard self-avoiding walk on the hypercubic (integer) lattice behaves in many respects like the simple random walk. In particular, it is shown that the leading asymptotic behaviour of the number of «-step self-avoiding walks is purely exponential, that the mean square displacement is asymptotically linear in the number of ...
متن کاملSelf Avoiding Walks in Four Dimensions: Logarithmic Corrections
We present simulation results for long (N ≤ 4000) self-avoiding walks in four dimensions. We find definite indications of logarithmic corrections, but the data are poorly described by the asymptotically leading terms. Detailed comparisons are presented with renormalization group flow equations derived in direct renormalization and with results of a field theoretic calculation.
متن کاملSelf-avoiding walk enumeration via the lace expansion
We introduce a new method for the enumeration of self-avoiding walks based on the lace expansion. We also introduce an algorithmic improvement, called the two-step method, for self-avoiding walk enumeration problems. We obtain significant extensions of existing series on the cubic and hypercubic lattices in all dimensions d ≥ 3: we enumerate 32-step self-avoiding polygons in d = 3, 26-step self...
متن کاملNew Lower Bounds on the Self-Avoiding-Walk Connective Constant
We give an elementary new method for obtaining rigorous lower bounds on the connective constant for self-avoiding walks on the hypercubic lattice Zd. The method is based on loop erasure and restoration, and does not require exact enumeration data. Our bounds are best for high d, and in fact agree with the rst four terms of the 1=d expansion for the connective constant. The bounds are the best t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008